Meta-Active Learning in Probabilistically Safe Optimization

نویسندگان

چکیده

When a robotic system is faced with uncertainty, the must take calculated risks to gain information as efficiently possible while ensuring safety. The need safely and in face of uncertainty spans domains from healthcare search rescue. To learn when data scarce or difficult label, active learning acquisition functions intelligently select point that, if label were known, would most improve estimate unknown model. Unfortunately, prior work suffers an inability accurately quantify information-gain, generalize new domains, ensure safe operation. overcome these limitations, we develop Safe MetAL, probabilistically-safe, algorithm which meta-learns function for selecting sample efficient points safety critical domains. key our approach novel integration meta-active chance-constrained optimization. We (1) meta-learn based on history, (2) encode this optimization framework, (3) solve information-rich set enforcing probabilistic guarantees. present state-of-the-art results model damaged UAV optimal parameters deep brain stimulation. Our achieves 41% improvement 20% speedup computation time compared meta-learning approaches system.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistically Safe Broadcast Algorithms

Message ordering abstractions and more speci cally group communication protocols are very use ful for the design of reliable distributed systems Brie y speaking message ordering abstractions en sure agreement on which messages are delivered in the system and on the order such messages are delivered Many problems related to reliable and highly available computation have been solved using one to ...

متن کامل

Meta-learning and meta-optimization

Meta-learning is a method of improving results of algorithm by learning from metafeatures which describe problem instances and from results produced by various algorithms on these instances. In this project we tried to apply this idea, which was already proved to be useful in machine learning, to combinatorial optimization. We have developed a general software tool called SEAGE to extract meta-...

متن کامل

Learning to Plan Probabilistically

This paper discusses the learning of probabilistic planning without a priori domain-specific knowledge. Different from existing reinforcement learning algorithms that generate only reactive policies and existing probabilistic planning algorithms that requires a substantial amount of a priori knowledge in order to plan, we devise a two-stage bottom-up learning-to-plan process, in which first rei...

متن کامل

Probabilistically Safe Vehicle Control in a Hostile Environment

In this paper we present an approach to control a vehicle in a hostile environment with static obstacles and moving adversaries. The vehicle is required to satisfy a mission objective expressed as a temporal logic specification over a set of properties satisfied at regions of a partitioned environment. We model the movements of adversaries in between regions of the environment as Poisson proces...

متن کامل

Probabilistically Safe Avoidance of Dynamic Obstacles with Uncertain Motion Patterns

This paper presents a real-time path planning algorithm which can guarantee probabilistic feasibility for autonomous robots subject to process noise and an uncertain environment, including dynamic obstacles with uncertain motion patterns. The key contribution of the work is the integration of a novel method for modeling dynamic obstacles with uncertain future trajectories. The method, denoted a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE robotics and automation letters

سال: 2022

ISSN: ['2377-3766']

DOI: https://doi.org/10.1109/lra.2022.3193497